翻訳と辞書
Words near each other
・ Autonomic networking
・ Automolis pallida
・ Automolis subulva
・ Automoloch
・ Automolodes
・ Automolus
・ Automonopoli
・ Automorphic
・ Automorphic factor
・ Automorphic form
・ Automorphic Forms on GL(2)
・ Automorphic function
・ Automorphic L-function
・ Automorphic number
・ Automorphism
Automorphism group of a free group
・ Automorphisms of the symmetric and alternating groups
・ AutoMotionTV
・ Automotive acronyms and abbreviations
・ Automotive aerodynamics
・ Automotive Aftermarket Industry Association
・ Automotive battery
・ Automotive Building
・ Automotive business development center
・ Automotive city
・ Automotive Cluster of Wallonia
・ Automotive Component Manufacturers Association of India
・ Automotive Components Holdings
・ Automotive Corridor
・ Automotive Crash Injury Research Center


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Automorphism group of a free group : ウィキペディア英語版
Automorphism group of a free group
In mathematical group theory, the automorphism group of a free group is a discrete group of automorphisms of a free group. The quotient by the inner automorphisms is the outer automorphism group of a free group, which is similar in some ways to the mapping class group of a surface.
==Presentation==

showed that the automorphism defined by the elementary Nielsen transformations generates the full automorphism group of a finitely generated free group. Nielsen, and later Bernhard Neumann used these ideas to give finite presentations of the automorphism groups of free groups. This is also described in .
The automorphism group of the free group with ordered basis (''x''1, …, ''x''''n'' ) is generated by the following 4 elementary Nielsen transformations:
* Switch ''x''1 and ''x''2
* Cyclically permute ''x''1, ''x''2, …, ''x''''n'', to ''x''2, …, ''x''''n'', ''x''1.
* Replace ''x''1 with ''x''1−1
* Replace ''x''1 with ''x''1·''x''2
These transformations are the analogues of the elementary row operations. Transformations of the first two kinds are analogous to row swaps, and cyclic row permutations. Transformations of the third kind correspond to scaling a row by an invertible scalar. Transformations of the fourth kind correspond to row additions.
Transformations of the first two types suffice to permute the generators in any order, so the third type may be applied to any of the generators, and the fourth type to any pair of generators.
Nielsen gave a rather complicated finite presentation using these generators, described in .

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Automorphism group of a free group」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.